Formal Veriication of Safety-critical Hybrid Systems Formal Veriication of Safety-critical Hybrid Systems

نویسنده

  • Carolos Livadas
چکیده

This thesis investigates how the formal modeling and veri cation techniques of computer science can be used for the analysis of hybrid systems [7,14,22,37]| systems involving both discrete and continuous behavior. The motivation behind such research lies in the inherent similarity of the hierarchical and decentralized control strategies of hybrid systems and the communication and operation protocols used for distributed systems in computer science. As a case study, the thesis focuses on the development of techniques that use hybrid I/O automata [29, 30] to model and analyze automated vehicle transportation systems and, in particular, their various protection subsystems | control systems that are used to ensure that the physical plant at hand does not violate its various safety requirements. The thesis is split into two major parts. In the rst part, we develop an abstract model of a physical plant and its various protection subsystems | also referred to as protectors. The specialization of this abstract model results in the speci cation of a particular automated transportation system. Moreover, the proof of correctness of the abstract model leads to simple correctness proofs of the protector implementations for particular specializations of the abstract model. In this framework, the composition of independent protectors is straightforward | their composition guarantees the conjunction of the safety properties guaranteed by the individual protectors. In fact, it is shown that under certain conditions composition holds for dependent protectors also. In the second part, we specialize the aforementioned abstract model to simpli ed versions of the personal rapid transit system (PRT 2000) under development at Raytheon Corporation. We examine overspeed and collision protection for a set of vehicles traveling on straight tracks, on binary merges, and on a directed graph of tracks involving binary merges and diverges. In each case, the protectors sample the state of the physical plant and take protective actions to guarantee that the physical plant does not reach hazardous states. The proofs of correctness of such protectors involve specializing the abstract protector to the physical plant at hand and proving that the suggested protector implementations are correct. This is done by de ning simulations among the states of the protector implementations and their abstract counterparts. Thesis Supervisor: Nancy A. Lynch, Ph.D. Title: NEC Professor of Software Science and Engineering

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Formal Veriication of Safety-critical Hybrid Systems ?

This paper investigates how formal techniques can be used for the analysis and veriication of hybrid systems 1,5,7,16] | systems involving both discrete and continuous behavior. The motivation behind such research lies in the inherent similarity of the hierarchical and decentralized control strategies of hybrid systems and the communication and operation protocols used for distributed systems i...

متن کامل

The Formal Verification of an Algorithm for Interactive Consistency under a Hybrid Fault Model

Modern veriication systems such as PVS are now reaching the stage of development where the formal veriication of critical algorithms is feasible with reasonable eeort. This paper describes one such veriication in the eld of fault tolerance. The distribution of single-source data to replicated computing channels (Interactive Consistency or Byzantine Agreement) is a central problem in this eld. T...

متن کامل

A Formally Veriied Algorithm for Interactive Consistency under a Hybrid Fault Model

Thambidurai and Park 13] have proposed an algorithm for Interactive Consistency that retains resilience to the arbitrary (or Byzantine) fault mode, while tolerating more faults of simpler kinds than standard Byzantine-resilent algorithms. Unfortunately, and despite a published proof of correctness, their algorithm is awed. We detected this while undertaking a formal veriication of the algorithm...

متن کامل

Modeling and Veriication of a Simple Real-time Railroad Gate Controller

We address the formal speciication and veriication of a simple train crossing gate system using the Nqthm logic and automated proof system of Boyer and Mooree6]. This problem has been suggestedd10] as a benchmark for evaluating the performance of speciication tools and automated reasoning systems in the area of safety-critical systems. The system speciication is presented and the proof of safet...

متن کامل

A Formal Veri cation Environment for RailwaySignaling System Design

A fundamental problem in the design and development of embedded control systems is the veriication of safety requirements. Formal methods, ooering a mathematical way to specify and analyze the behavior of a system, together with the related support tools can successfully be applied in the formal proof that a system is safe. However, the complexity of real systems is such that automated tools of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997